Orthogonal Projection Pursuit Using Genetic Optimization
نویسندگان
چکیده
Projection pursuit is concerned with finding interesting lowdimensional subspace of multivariate data. In this paper we proposed a genetic optimization approach to find the globally optimal orthogonal subspace given training data and user defined criterion on what subspaces are interesting. We then applied this approach to human face recognition. Suppose face recognition is done by simple correlation, a subspace is obtained using our approach that achieve the lowest error rate of face recognition given FERET data set as training set. As Yambor [1] showed in experiments that PCA subspace is a pretty good subspace for correlation-based face recognition, we compared the performance of the subspace we obtained with that of PCA subspace. Experiment result showed this subspace outperformed PCA subspace.
منابع مشابه
Generalized Cellular Neural Networks (Gcnns) Constructed Using Particle Swarm Optimization for Spatio-Temporal Evolutionary Pattern Identification
Particle swarm optimisation (PSO) is introduced to implement a new constructive learning algorithm for training generalised cellular neural networks (GCNNs) for the identification of spatiotemporal evolutionary (STE) systems. The basic idea of the new PSO-based learning algorithm is to successively approximate the desired signal by progressively pursuing relevant orthogonal projections. This ne...
متن کاملLow Bit Rate Image Compression with Orthogonal Projection Pursuit Neural Networks
A new multiresolution algorithm for image compression based on projection pursuit neural networks is presented. High quality low bit-rate image compression is achieved first by segmenting an image into regions of different sizes based on perceptual variation in each region and then constructing a distinct code for each block by using the orthogonal projection pursuit neural networks. This algor...
متن کاملOptimized Projection Matrix for Compressive Sensing
Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the p...
متن کاملSparse Representations for Structured Noise Filtering
The role of sparse representations in the context of structured noise filtering is discussed. A strategy, especially conceived so as to address problems of an ill posed nature, is presented. The proposed approach revises and extends the Oblique Matching Pursuit technique. It is shown that, by working with an orthogonal projection of the signal to be filtered, it is possible to apply orthogonal ...
متن کاملDetecting multivariate outliers using projection pursuit with particle swarm optimization
Detecting outliers in the context of multivariate data is known as an important but difficult task and there already exist several detection methods. Most of the proposed methods are based either on the Mahalanobis distance of the observations to the center of the distribution or on a projection pursuit (PP) approach. In the present paper we focus on the one-dimensional PP approach which may be...
متن کامل